Confluent Layered Drawings

Delta-Confluent Drawings

We generalize the tree-confluent graphs to a broader class of graphs called ∆-confluent graphs. This class of graphs and distancehereditary graphs, a well-known class of graphs, coincide. Some results about the visualization of ∆-confluent graphs are also given.

Confluent Orthogonal Drawings of Syntax Diagrams

We provide a pipeline for generating syntax diagrams (also called railroad diagrams) from context free grammars. Syntax diagrams are a graphical representation of a context free language, which we formalize abstractly as a set of mutually recursive nondeterministic finite automata and draw by combining elements from the confluent drawing, layered drawing, and smooth orthogonal drawing styles. W...

Biclique Edge Cover Graphs and Confluent Drawings

Confluent drawing is a technique that allows some non-planar graphs to be visualized in a planar way. This approach merges edges together, drawing groups of them as single tracks, similar to train tracks. In the general case, producing confluent drawings automatically has proven quite difficult. We introduce the biclique edge cover graph that represents a graph G as an interconnected set of cli...

Contents 1 Layered Drawings of

Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way

We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach allows us to draw, in a crossing-free manner, graphs—such as software interaction diagrams—that would normally have many crossings. The main idea of this approach is quite simple: we allow groups of edges to be merged tog...